A Study of Different Parallel Implementations of Single Source Shortest Path Algorithms
نویسندگان
چکیده
We present a study of parallel implementations of single source shortest path (SSSP) algorithms. In the last three decades number of parallel SSSP algorithms have been developed and implemented on the different type of machines. We have divided some of these implementations into two groups, first are those where parallelization is achieved in the internal operations of sequential SSSP algorithm and second are where an actual graph is divided into sub-graphs, and serial SSSP algorithm executes parallel on separate processing units for each sub-graph. These parallel implementations have used PRAM, CRAY super-computer, dynamically reconfigurable processor and Graphics processing unit as platform to run them.
منابع مشابه
Single-Source Shortest Paths with the Parallel Boost Graph Library
The Parallel Boost Graph Library (Parallel BGL) is a library of graph algorithms and data structures for distributed-memory computation on large graphs. Developed with the Generic Programming paradigm, the Parallel BGL is highly customizable, supporting various graph data structures, arbitrary vertex and edge properties, and different communication media. In this paper, we describe the implemen...
متن کاملEfficient Parallel Implementation of Single Source Shortest Path Algorithm on GPU Using CUDA
In today‟s world there are number of applications like routing in telephone networks, traveller information system, robotic path selection etc., where data can be represented as a graph and different graph algorithms are executed on it to fulfil the requirements of the application. Data related to these applications are growing every day, but we still need quick and real time responses from the...
متن کاملALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملParallel implementation of geometric shortest path algorithms
In application areas such as GIS, the Euclidean metric is often less meaningfully applied to determine a shortest path than metrics which capture, through weights, the varying nature of the terrain (e.g., water, rock, forest). Considering weighted metrics however increases the run-time of algorithms considerably suggesting the use of a parallel approach. In this paper, we provide a parallel imp...
متن کاملImplementations of routing algorithms for transportation networks
We discuss the generalization of the point-to-point (and single-source) shortest path problem to instances where the shortest path must satisfy a formal language constraint. We describe theoretical and experimental results on a generalization of Dijkstra’s algorithm to finding regular-language-constrained shortest paths. This algorithm forms a model for single-source shortest paths and point-to...
متن کامل